Related Issue

Fixes #1481

Description

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.

You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.

For each 0 <= i < nums1.length, find the index j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums2. If there is no next greater element, then the answer for this query is -1.

Return an array ans of length nums1.length such that ans[i] is the next greater element as described above.
[Please include a brief description of the changes or features added]

Type of PR

• Bug fix
• Feature enhancement
• Documentation update
• Security enhancement
• Other (specify): _______________

Screenshots / Videos (if applicable)

[Attach any relevant screenshots or videos demonstrating the changes]

Checklist

• I have performed a self-review of my code.
• I have read and followed the Contribution Guidelines.
• I have tested the changes thoroughly before submitting this pull request.
• I have provided relevant issue numbers, screenshots, and videos after making the changes.
• I have commented my code, particularly in hard-to-understand areas.
• I have followed the code style guidelines of this project.
• I have checked for any existing open issues that my pull request may address.
• I have ensured that my changes do not break any existing functionality.
• Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently.
• I have read the resources for guidance listed below.
• I have followed security best practices in my code changes.

Additional Context

[Include any additional information or context that might be helpful for reviewers.]

Resources for Guidance

Please read the following resources before submitting your contribution:

• Code Harbor Hub Community Features
• Docusaurus Documentation
• React.js Documentation
• Markdown Guide
• MDX Documentation
• Mermaid Documentation

Resources for DSA Features on Our Site:

• Tabs: Switch Languages
• Line Numbering
• Math Equations

Contribution Guidelines

Thank you for considering contributing to our project! To ensure smooth collaboration and effective contribution management, please adhere to the following guidelines:

Issue Creation

1. Limit on Issues:
   • Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently.

Contribution Levels

2. Basic Contributions:

   • This project is primarily focused on documentation. Most of the setup has been completed, so contributors will generally need to work on basic code tasks, such as writing tests.
   • For these tasks, issues will be assigned the level1 label.

3. Acknowledging Hard Work:

   • If a contributor puts in significant effort on a task, the issue will be upgraded to level2. This is our way of recognizing and appreciating extra effort.

4. Feature Additions and Component Work:

   • Contributors working on new features or components using JSX/TSX will be assigned a level based on the complexity and quality of their work.
   • The more complex and valuable the contribution, the higher the level assigned.

Level Definitions

• Level1:
  • Tasks are straightforward, such as fixing minor bugs, writing tests, or making simple documentation updates.
• Level2:
  • Tasks require more effort, such as addressing complex bugs, improving existing features, or making substantial documentation improvements.
• Level3:
  • Tasks are highly complex and involve significant new feature development, major refactoring, or extensive contributions to the project’s core components.

We look forward to your contributions and appreciate your effort in helping us improve the project!